Finding the edge connectivity of directed graphsMANSOUR, Y; SCHIEBER, B.Journal of algorithms (Print). 1989, Vol 10, Num 1, pp 76-85, issn 0196-6774, 10 p.Article

Connectivity of generalized prisms over GPIAZZA, B. L; RINGEISEN, R. D.Discrete applied mathematics. 1991, Vol 30, Num 2-3, pp 229-233, issn 0166-218X, 5 p.Article

Maximum critical n-edge connected graphsCOZZENS, M. B; WU, S.-S. Y.Journal of graph theory. 1989, Vol 13, Num 5, pp 559-568, issn 0364-9024, 10 p.Article

Characterization of graphs with infinite cyclic edge connectivityDINGJUN LOU; WEI WANG.Discrete mathematics. 2008, Vol 308, Num 11, pp 2094-2103, issn 0012-365X, 10 p.Article

Edge fault tolerance analysis of a class of interconnection networksQIANG ZHU; XU, Jun-Ming; MIN LV et al.Applied mathematics and computation. 2006, Vol 172, Num 1, pp 111-121, issn 0096-3003, 11 p.Article

k-Restricted edge connectivity for some interconnection networksSHIYING WANG; JUN YUAN; AIXIA LIU et al.Applied mathematics and computation. 2008, Vol 201, Num 1-2, pp 587-596, issn 0096-3003, 10 p.Article

A note about shortest cycle coversJINLONG SHU; ZHANG, Cun-Quan.Discrete mathematics. 2005, Vol 301, Num 2-3, pp 232-238, issn 0012-365X, 7 p.Article

Some remarks on λ_p,q-connectednessRAUTENBACH, Dieter; VOLKMANN, Lutz.Discrete mathematics. 2008, Vol 308, Num 23, pp 5562-5569, issn 0012-365X, 8 p.Article

Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimalZHAO ZHANG; JINJIANG YUAN.Discrete mathematics. 2007, Vol 307, Num 2, pp 293-298, issn 0012-365X, 6 p.Article

A Generalization of an Edge-Connectivity Theorem of ChartrandBOESCHT, Frank; GROSS, Daniel; SACCOMAN, John T et al.Networks (New York, NY). 2009, Vol 54, Num 2, pp 82-89, issn 0028-3045, 8 p.Article

An edge-splitting algorithm in planar graphsNAGAMOCHI, Hiroshi; EADES, Peter.Journal of combinatorial optimization. 2003, Vol 7, Num 2, pp 137-159, issn 1382-6905, 23 p.Article

On the existence of edge cuts leaving several large componentsRAUTENBACH, Dieter; VOLKMANN, Lutz.Discrete mathematics. 2009, Vol 309, Num 6, pp 1703-1707, issn 0012-365X, 5 p.Article

Uniform cyclic edge connectivity in cubic graphsALDRED, R. E. L; HOLTON, D. A; JACKSON, B et al.Combinatorica (Print). 1991, Vol 11, Num 2, pp 81-96, issn 0209-9683Article

Major n-connected graphsOELLERMANN, O. R.Journal of the Australian Mathematical Society. Series A, Pure mathematics. 1989, Vol 47, Num 1, pp 43-52, issn 0334-3316, 10 p.Article

The maximal size of graphs with at most k edge-joint paths connecting any two adjacent verticesMAO-CHENG CAI.Discrete mathematics. 1990, Vol 85, Num 1, pp 43-52, issn 0012-365X, 10 p.Article

Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2SHIYING WANG; SHANGWEI LIN; CHUNFANG LI et al.Discrete mathematics. 2009, Vol 309, Num 4, pp 908-919, issn 0012-365X, 12 p.Article

Extra edge connectivity of hypercube-like networksHONG, Won-Sin; HSIEH, Sun-Yuan.International journal of parallel, emergent and distributed systems (Print). 2013, Vol 28, Num 2, pp 123-133, issn 1744-5760, 11 p.Article

Local-edge-connectivity in digraphs and oriented graphsVOLKMANN, Lutz.Discrete mathematics. 2007, Vol 307, Num 24, pp 3207-3212, issn 0012-365X, 6 p.Article

A note on The super connectivity of augmented cubesMEIJIE MA; XUEGONG TAN; XU, Jun-Ming et al.Information processing letters. 2009, Vol 109, Num 12, pp 592-593, issn 0020-0190, 2 p.Article

Extra edge connectivity and isoperimetric edge connectivityZHAO ZHANG.Discrete mathematics. 2008, Vol 308, Num 20, pp 4560-4569, issn 0012-365X, 10 p.Article

Super edge-connectivity of mixed Cayley graphJINYANG CHEN; JIXIANG MENG; LIHONG HUANG et al.Discrete mathematics. 2009, Vol 309, Num 1, pp 264-270, issn 0012-365X, 7 p.Article

The super connectivity of shuffle-cubesXU, Jun-Ming; MIN XU; QIANG ZHU et al.Information processing letters. 2005, Vol 96, Num 4, pp 123-127, issn 0020-0190, 5 p.Article

On a kind of restricted edge connectivity of graphsJIXIANG MENG; YOUHU JI.Discrete applied mathematics. 2002, Vol 117, Num 1-3, pp 183-193, issn 0166-218XArticle

An analysis of edge fault tolerance in recursively decomposable regular networksLAGMAN, A; NAJJAR, W. A; SRIMANI, P. K et al.IEEE transactions on computers. 1994, Vol 43, Num 4, pp 470-475, issn 0018-9340Article

On super-edge-connected digraphs and bipartite digraphsFIOL, M. A.Journal of graph theory. 1992, Vol 16, Num 6, pp 545-555, issn 0364-9024Article